Dimensionality Reduction with Spherical Constraints

نویسنده

  • Arvind Agarwal
چکیده

“Curse of dimensionality” has been a significant obstacle to solving many problems. One way to avoid this obstacle is to use dimensionality reduction methods to reduce the dimension of the data while preserving the properties of the data. Reader is referred to [Saul, 2005, Fodor, 2002] for a detailed review of these dimensionality reduction methods. Almost all of these dimensionality reduction methods embed the data into a lower dimensional subspace without assuming anything about the structure of the embedding space. There are problems, in which one wants the embedding space to have a special structure i.e. spherical structure. More specifically, if points lie on a sphere in the original space, points in the lower dimensional subspace should also lie on a sphere. In this work, we aim at solving exactly this problem. We reduce the dimensionality of the data that lie on a higher dimensional sphere while maintaining this spherical structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tech. Report: Matrix dimensionality reduction for LSI using Spherical K-means

In this paper, we propose using Spherical K-means algorithm as a preprocessing step to using Latent Semantic Indexing (LSI). LSI is a well known approach in Information Retrieval (IR). Spherical K-means is a fast clustering algorithm that puts similar documents together, thus forming K clusters. We propose using Spherical Kmeans to form the matrix of normalized concept vectors yields high reduc...

متن کامل

Semi-Supervised Dimensionality Reduction

Dimensionality reduction is among the keys in mining highdimensional data. This paper studies semi-supervised dimensionality reduction. In this setting, besides abundant unlabeled examples, domain knowledge in the form of pairwise constraints are available, which specifies whether a pair of instances belong to the same class (must-link constraints) or different classes (cannot-link constraints)...

متن کامل

Fast Non-negative Dimensionality Reduction for Protein Fold Recognition

In this paper, dimensionality reduction via matrix factorization with nonnegativity constraints is studied. Because of these constraints, it stands apart from other linear dimensionality reduction methods. Here we explore nonnegative matrix factorization in combination with a classifier for protein fold recognition. Since typically matrix factorization is iteratively done, convergence can be sl...

متن کامل

2D Dimensionality Reduction Methods without Loss

In this paper, several two-dimensional extensions of principal component analysis (PCA) and linear discriminant analysis (LDA) techniques has been applied in a lossless dimensionality reduction framework, for face recognition application. In this framework, the benefits of dimensionality reduction were used to improve the performance of its predictive model, which was a support vector machine (...

متن کامل

A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters

Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009